Validity in intensional languages: a new approach

نویسندگان

  • William H. Hanson
  • James Hawthorne
چکیده

Although the use of possible worlds in semantics has been very fruitful and is now widely accepted, there is a puzzle about the standard definition of validity in possible-worlds semantics that has received little notice and virtually no comment. A sentence of an intensional language is typically said to be valid just in case it is true at every world under every model on every model structure of the language. Each model structure contains a set of possible worlds, and models are defined relative to model structures, assigning truth-values to sentences at each world countenanced by the model structure. The puzzle is why more than one model structure is used in the definition of validity. There is presumably just one class of all possible worlds and just one model structure defined on this class that does correctly the things that model structures are supposed to do. (These include, but need not be limited to, specifying the set of individuals in each world as well as various accessibility relations between worlds.) Why not define validity simply as truth at every world under every model on this one model structure? What is the point of bringing in more model structures than just this one? We investigate these questions in some detail and conclude that for many intensional languages the puzzle points to a genuine difficulty: the standard definition of validity is insufficiently motivated. We begin (Section 1) by showing that a plausible and natural account of validity for intensional languages can be based on a single model structure, and that validity so defined is analogous in important respects to the standard account of validity for extensional languages. We call this notion of validity "validity!", and in Section 2 we contrast it with the standard notion, which we call "validity2". Several attempts are made to discover a rationale for the almost universal acceptance of validity2, but in most of these attempts we come up empty-handed. So in Section 3 we investigate validity! for some intensional languages. Our investigation includes providing axiomatizations for several propositional and predicate logics, most of which are provably complete. The completeness proofs are given in the Appendix, which also contains a sketch of a compactness proof for one of the predicate logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-Order Functional Languages and Intensional Logic

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates userdefined functions from the source program, by appropriately introducing context-manipulation (i.e., intensional) operators. Th...

متن کامل

First-Order Functional Languages and Intensional Logic

The purpose of this paper is to demonstrate that first-order functional programs can be transformed into intensional programs of nullary variables, in a semantics preserving way. On the foundational side, the goal of our study is to bring new insights and a better understanding of the nature of functional languages. From a practical point of view, our investigation provides a formal basis for t...

متن کامل

Intensional and Extensional Languages in Conceptual Modelling

In conceptual modelling, there are many competing views of the role of the modelling language. In this paper, we propose a clarifying classification of different kinds of languages. This classification, based on the semantical background theory of each kind of language, divides the modelling languages into three categories: extensional modelling languages, languages based on concept calculus (i...

متن کامل

Intensional Programming Languages

This article introduces the basic notions behind the intensional programming paradigm. Intensional Logic—which is the underlying theoretical framework of intensional languages is described and motivated by examples. One-dimensional and multidimensional intensional languages are discussed and existing intensional systems are surveyed. The article concludes with a presentation of the most success...

متن کامل

An Operational Approach to Fine-Grained Intensionality

Classical intensional semantic frameworks, like Montague’s Intensional Logic (IL), identify intensional identity with logical equivalence. This criterion of co-intensionality is excessively coarse-grained, and it gives rise to several well known difficulties. Theories of fine-grained intensionality have been been proposed to avoid this problem. Several of these provide a formal solution to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 26  شماره 

صفحات  -

تاریخ انتشار 1985